Computing Subdivision Surface Intersection
نویسندگان
چکیده
&RPSXWLQJ VXUIDFH LQWHUVHFWLRQV LV D IXQGDPHQWDO SUREOHP LQ JHRPHWULF PRGHOLQJ $Q\ ERROHDQ RSHUDWLRQ FDQ EH VHHQ DV DQ LQWHUVHFWLRQ FDOFXODWLRQ IROORZHG E\ D VHOHFWLRQ RI SDUWV QHFHVVDU\ IRU EXLOGLQJ WKH VXUIDFH RI WKH UHVXOWLQJ REMHFW 7KLV SDSHU GHDOV ZLWK WKH FRPSXWLQJ RI LQWHUVHFWLRQ FXUYHV RQ VXEGLYLVLRQ VXUIDFHV VXUIDFHV JHQHUDWHG E\ WKH /RRS VFKHPH :H SUHVHQW WKUHH YDULDQWV RI RXU DOJRULWKP 7KH ILUVW YDULDQW FDOFXODWHV WKLV LQWHUVHFWLRQ DIWHU D FODVVLILFDWLRQ RI WKH REMHFW IDFHV LQWR LQWHUVHFWLQJ DQG QRQ LQWHUVHFWLQJ SDLUV RI IDFHV 7KH VHFRQG YDULDQW LV EDVHG RQ WKH QHLJKERUKRRG RI WKH LQWHUVHFWLQJ IDFHV 7KH WKLUG YDULDQW XVHV WKH FRQFHSW RI ELSDUWLWH JUDSK
منابع مشابه
A Marching Method for Computing Intersection Curves of Two Subdivision Solids
This paper presents a marching method for computing intersection curves between two solids represented by subdivision surfaces of Catmull-Clark or Loop type. It can be used in trimming and boolean operations for subdivision surfaces. The main idea is to apply a marching method with geometric interpretation to trace the intersection curves. We first determine all intersecting regions, then find ...
متن کاملAlgebraic pruning: a fast technique for curve and surface intersection
Computing the intersection of parametric and algebraic curves and surfaces is a fun damental problem in computer graphics and geometric modeling This problem has been extensively studied in the literature and di erent techniques based on subdivision interval analysis and algebraic formulation are known For low degree curves and surfaces algebraic methods are considered to be the fastest whereas...
متن کاملEstimating Error Bounds for Ternary Subdivision Curves / Surfaces
We estimate error bounds between ternary subdivision curves/surfaces and their control polygons after k-fold subdivision in terms of the maximal differences of the initial control point sequences and constants that depend on the subdivision mask. The bound is independent of the process of subdivision and can be evaluated without recursive subdivision. Our technique is independent of parametriza...
متن کاملEstimating error bounds for binary subdivision curves/surfaces
We estimate error bounds between binary subdivision curves/surfaces and their control polygons after k-fold subdivision in terms of the maximal differences of the initial control point sequences and constants that depend on the subdivision mask. The bound is independent of the process of subdivision and can be evaluated without recursive subdivision. Our technique is independent of parameteriza...
متن کاملSurface intersection using parallelism
The support of Boolean set operations in free-form solid modeling systems requires the repeated intersection of parametric surfaces. Present approaches to this problem are sequential and must make trade-offs between accuracy, robustness and efficiency. In this paper, we investigate a parallel approach to the surface intersection problem that shows, both theoretically and empirically, that with ...
متن کاملFast Intersections for Subdivision Surfaces
Subdivision surface intersections can be costly to compute. They require the intersection of high resolution meshes in order to obtain accurate results, which can lead to slow performance and high memory usage. In this paper we show how the strong convex hull property can lead to a method for efficiently computing intersections at high resolutions. Consequently, the method can be used with any ...
متن کامل